package jjn.kamacoder.case11;

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()) {
            int count = sc.nextInt();
            Map<Integer, Integer> relationMap = new HashMap<>();
            for (int i = 0; i < count; i++) {
                int a = sc.nextInt();
                int b = sc.nextInt();
                relationMap.put(a, b);
            }
            int first = 0;
            int second = 0;
            Integer start1 = 1;
            Integer start2 = 2;
            while (true) {
                Integer i = relationMap.get(start1);
                if (i == null) {
                    break;
                }
                first++;
                start1 = i;
            }
            while (true) {
                Integer i = relationMap.get(start2);
                if (i == null) {
                    break;
                }
                second++;
                start2 = i;
            }
            if (first > second) {
                System.out.println("You are my elder");
            } else if (first == second) {
                System.out.println("You are my brother");
            } else {
                System.out.println("You are my younger");
            }
        }
    }
}
